Groebner bases of reaction networks with intermediate species
نویسندگان
چکیده
In this work we consider the computation of Gröbner bases of the steady state ideal of reaction networks equipped with mass-action kinetics. Specifically, we focus on the role of intermediate species and the relation between the extended network (with intermediate species) and the core network (without intermediate species). We show that a Gröbner basis of the steady state ideal of the core network always lifts to a Gröbner basis of the steady state ideal of the extended network by means of linear algebra, with a suitable choice of monomial order. As illustrated with examples, this contributes to a substantial reduction of the computation time, due mainly to the reduction in the number of variables and polynomials. We further show that if the steady state ideal of the core network is binomial, then so is the case for the extended network, as long as an extra condition is fulfilled. For standard networks, this extra condition can be visually explored from the network structure alone.
منابع مشابه
Groebner Bases Computation in Boolean Rings is P-SPACE
The theory of Groebner Bases, which has recently been honored with the ACM Paris Kanellakis Theory and Practice Award, has become a crucial building block to computer algebra, and is widely used in science, engineering, and computer science. It is wellknown that Groebner bases computation is EXP-SPACE in a general polynomial ring setting. However, for many important applications in computer sci...
متن کاملA P-SPACE Algorithm for Groebner Bases Computation in Boolean Rings
The theory of Groebner Bases, which has recently been honored with the ACM Paris Kanellakis Theory and Practice Award, has become a crucial building block to computer algebra, and is widely used in science, engineering, and computer science. It is wellknown that Groebner bases computation is EXP-SPACE in a general setting. In this paper, we give an algorithm to show that Groebner bases computat...
متن کاملGroebner Bases in Non-Commutative Algebras
INTRODUCTION Recently, the use of Groebner bases and Buchberger algorithm [BUC1,2,4] has been generalised from the case of commutative polynomials to finitely generated algebras R over a field k, R = k, s.t. for each i < j, for some cij ∈ k, for some commutative polynomial pij ∈ k[X1,...,Xn], one has xj xi cij xi xj = pij(x1,...,xn). The first results in this direction were due to Ga...
متن کاملConstruction of Gröbner Bases: Avoiding S-Polynomials – Buchberger’s First Criterium
We continue the formalization of Groebner bases following the book “Groebner Bases – A Computational Approach to Commutative Algebra” by Becker and Weispfenning. Here we prove Buchberger’s first criterium on avoiding S-polynomials: S-polynomials for polynomials with disjoint head terms need not be considered when constructing Groebner bases. In the course of formalizing this theorem we also int...
متن کاملGroebner Bases and the Cohomology of Grassmann Manifolds with Application to Immersion
LetGk,n be the Grassmannmanifold of k-planes inR . Borel showed that H∗ (Gk,n; Z2) = Z2 [w1, . . . , wk] /Ik,n where Ik,n is the ideal generated by the dual Stiefel-Whitney classes wn+1, . . . , wn+k. We compute Groebner bases for the ideals I2,2i−3 and I2,2i−4 and use these results along with the theory of modi ed Postnikov towers to prove new immersion results, namely that G2,2i−3 immerses in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018